Extensions of Constraint Solving for Proof PlanningErica
نویسنده
چکیده
The integration of constraint solvers into proof planning has pushed the problem solving horizon. Proof planning beneets from the general functionalities of a constraint solver such as consistency checks, constraint inference, as well as the search for instantiations. However, oo-the-shelf constraint solvers are usually geared towards their typical applications. Since proof planning diiers from other applications, we present extensions of constraint solving necessary for its use in proof planning. We think that these extensions can broaden the range applications of constraint solving even beyond proof planning.
منابع مشابه
Extensions of Constraint Solving for Proof Planning Extensions of Constraint Solving for Proof Planning
The integration of constraint solvers into proof planning has pushed the problem solving horizon. Proof planning beneets from the general functionalities of a constraint solver such as consistency checks, constraint inference, as well as the search for instantiations. However, oo-the-shelf constraint solvers are usually geared towards their typical applications. Since proof planning diiers from...
متن کاملExtensions of Constraint Solving for Proof Planning
The integration of constraint solvers into proof planning has pushed the problem solving horizon. Proof planning benefits from the general functionalities of a constraint solver such as consistency check, constraint inference, as well as the search for instantiations. However, off-the-shelf constraint solvers need to be extended in order to be be integrated appropriately: In particular, for cor...
متن کاملApplying Lakatos-style reasoning to AI problems
Lakatos (1976) argued that mathematics develops in a much more organic way than its rigid textbook presentation of definition-theorem-proof would suggest. He outlined a heuristic approach which holds that mathematics progresses by a series of primitive conjectures, proofs, counterexamples, proof-generated concepts, modified conjectures and modified proofs. The purpose of this chapter is to appl...
متن کاملA New Method for Solving Constraint Satisfaction Problems
Many important problems in Artificial Intelligence can be defined as Constraint Satisfaction Problems (CSP). These types of problems are defined by a limited set of variables, each having a limited domain and a number of Constraints on the values of those variables (these problems are also called Consistent Labeling Problems (CLP), in which “Labeling" means assigning a value to a variable.) Sol...
متن کاملA New Method for Solving Constraint Satisfaction Problems
Many important problems in Artificial Intelligence can be defined as Constraint Satisfaction Problems (CSP). These types of problems are defined by a limited set of variables, each having a limited domain and a number of Constraints on the values of those variables (these problems are also called Consistent Labeling Problems (CLP), in which “Labeling means assigning a value to a variable.) Solu...
متن کامل